Redefining the Rules: Providing Race Models with a Connectionist Learning Rule
نویسندگان
چکیده
In this paper, we describe the Parallel Race Network (PRN), a race model with the ability to learn stimulus–response associations using a formal framework that is very similar to the one used by the traditional connectionist networks. The PRN assumes that the connections represent abstract units of time rather than strengths of association. Consequently, the connections in the network indicate how rapidly the information should be sent to an output unit. The decision is based on a race between the outputs. To make learning functional and autonomous, the Delta rule was modified to fit the time-based assumption of the PRN. Finally, the PRN is used to simulate an identification task and the implications of its mode of representation are discussed.
منابع مشابه
Connectionist perspectives on language learning, representation and processing.
The field of formal linguistics was founded on the premise that language is mentally represented as a deterministic symbolic grammar. While this approach has captured many important characteristics of the world's languages, it has also led to a tendency to focus theoretical questions on the correct formalization of grammatical rules while also de-emphasizing the role of learning and statistics ...
متن کاملConnectionist and Memory-Array Models of Artificial Grammar Learning
Subjects exposed to strings of letters generated by a finite state grammar can later classify grammatical and nongrammatical test strings, even though they cannot adequately say what the rules of the grammar are (e.g., Reber, 1989). The MINERVA 2 (Hintzman, 1986) and Medin and Schaffer (1978) memory-array models and a number of connectionis? autoassociator models are tested against experimental...
متن کاملExploiting Temporal Binding to Learn Relational Rules within a Connectionist Network
Rules encoded by traditional rule-based systems are brittle and innexible because it is diicult to specify the precise conditions under which a rule should re. If the conditions are made too speciic a rule does not always re when it should. If the conditions are made too general, the rule res even when it should not. In contrast, connectionist networks are considered to be capable of learning s...
متن کاملThe Dinosaurs and the Ring
Cognitive models based on rules and symbols typically require a high degree of handwiring. One way of avoiding the hand-wiring of rules is to rely on connectionist networks for modeling some of the core processes in language acquisition. However, connectionist models have problems with scalability and generativity. Ideally, we want a model that will keep the strengths of both symbolic and conne...
متن کاملEntropy Based Fuzzy Rule Weighting for Hierarchical Intrusion Detection
Predicting different behaviors in computer networks is the subject of many data mining researches. Providing a balanced Intrusion Detection System (IDS) that directly addresses the trade-off between the ability to detect new attack types and providing low false detection rate is a fundamental challenge. Many of the proposed methods perform well in one of the two aspects, and concentrate on a su...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Connect. Sci.
دوره 15 شماره
صفحات -
تاریخ انتشار 2003